Computational problem - PDFSEARCH.IO - Document Search Engine

Computational problem
Results: 1172

#	Item
901	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Spanning tree Operations research Travelling salesman problem Approximation algorithm Time complexity NP-complete Algorithm Minimum spanning tree Theoretical computer science Computational complexity theory Applied mathematics
902	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:03 Operations research Complexity classes Mathematical optimization Approximation algorithms Job shop scheduling Polynomial-time approximation scheme Knapsack problem Optimization problem Dynamic programming Theoretical computer science Computational complexity theory Applied mathematics
903	Approximation Algorithms (ADM III) Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems NP-complete Set cover problem Vertex cover Approximation algorithm Greedy algorithm P versus NP problem NP Linear programming Theoretical computer science Computational complexity theory Mathematics
904	Chapter 3: Rounding Data and Dynamic Programming (cp. Williamson & Shmoys, Chapter[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Operations research Mathematical optimization Bin packing problem Polynomial-time approximation scheme Job shop scheduling Knapsack problem Strongly NP-complete Theoretical computer science Computational complexity theory Applied mathematics
905	Approximation Algorithms (ADM III) Martin Skutella TU Berlin WS[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-28 07:19:02 NP-complete problems Complexity classes Operations research Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Polynomial-time approximation scheme Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
906	Chapter 1: An Introduction to Approximation Algorithms (cp. Williamson & Shmoys, Chapter 1) 4 Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:22:49 Complexity classes NP-complete problems Mathematical optimization Combinatorial optimization Approximation algorithm Linear programming relaxation Set cover problem Vertex cover NP-complete Theoretical computer science Computational complexity theory Applied mathematics
907	Approximation Algorithms (ADM III) Martin Skutella TU Berlin WS[removed] Add to Reading List Source URL: www.coga.tu-berlin.de Language: English - Date: 2012-11-23 06:41:18 Mathematics Approximation algorithm Combinatorial optimization Optimization problem Algorithm L-reduction Theoretical computer science Computational complexity theory Applied mathematics
908	TSP with Bounded Metrics Lars Engebretsen1,? and Marek Karpinski2,?? 1 Department of Numerical Analysis and Computer Science Royal Institute of Technology Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2006-02-09 12:47:04 Complexity classes NP-complete problems Operations research Approximation algorithms Travelling salesman problem Combinatorial optimization APX Optimization problem PCP theorem Theoretical computer science Computational complexity theory Applied mathematics
909	Minimizing communication in all-pairs shortest paths Edgar Solomonik Aydin Buluc James Demmel Add to Reading List Source URL: www.eecs.berkeley.edu Language: English - Date: 2013-02-13 15:02:13 Analysis of algorithms Dynamic programming Network theory Operations research Floyd–Warshall algorithm Algorithm Semiring Shortest path problem Computational complexity theory Mathematics Theoretical computer science Applied mathematics
910	On Approximation Lower Bounds for TSP with Bounded Metrics Marek Karpinski∗ Richard Schmied† Add to Reading List Source URL: theory.cs.uni-bonn.de Language: English - Date: 2012-02-27 08:46:45 Complexity classes NP-complete problems Operations research Travelling salesman problem Approximation algorithm Optimization problem PCP theorem NP-complete APX Theoretical computer science Computational complexity theory Applied mathematics

UPDATE